Algorithms optimize circle packing in regular polygons

نویسندگان

چکیده

The complex geometrical problem of packing has applications in charge distribution and granular matter.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploring Circle Packing Algorithms

We present an interactive tool for visualizing and experimenting with different circle packing algorithms. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems—Geometrical problems and computations.

متن کامل

Formulation symmetries in circle packing

The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of formulation symmetries in MINLP instances. A software implementation of this method is used to conjecture the group structure of the problem symmetries of packing equal circles in a square. We provide a proof of the conje...

متن کامل

Recursive circle packing problems

This paper presents a class of packing problems where circles may be placed either inside or outside other circles, the whole set being packed in a rectangle. This corresponds to a practical problem of packing tubes in a container; before being inserted in the container, tubes may be put inside other tubes in a recursive fashion. A variant of the greedy randomized adaptive search procedure is p...

متن کامل

Circle Packing Explorations

Circle packing can be seen as the art of placing tangent circles on the plane, leaving as little unoccupied space as possible. Circle packing is a very attractive field of mathematics, from several points of view. It contains interesting and complex questions, both mathematical and algorithmical, and keeps its properties through a wide range of geometric transformations. There are several ways ...

متن کامل

A circle packing algorithm

A circle packing is a configuration P of circles realizing a specified pattern of tangencies. Radii of packings in the euclidean and hyperbolic planes may be computed using an iterative process suggested by William Thurston. We describe an efficient implementation, discuss its performance, and illustrate recent applications. A central role is played by new and subtle monotonicity results for “f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scilight

سال: 2023

ISSN: ['2572-7907']

DOI: https://doi.org/10.1063/10.0017442